Generalization of Rough Sets using Modal Logics

نویسندگان

  • Yiyu Yao
  • T. Y. Lin
چکیده

The theory of rough sets is an extension of set theory with two additional unary set-theoretic operators deened based on a binary relation on the universe. These two operators are related to the modal operators in modal logics. By exploring the relationship between rough sets and modal logics, this paper proposes and examines a number of extended rough set models. By the properties satissed by a binary relation, such as serial, reeexive, symmetric, transitive, and Euclidean, various classes of algebraic rough set models can be derived. They correspond to diierent modal logic systems. With respect to graded and probabilistic modal logics, graded and probabilistic rough set models are also discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Rough Quantiiers

Rough set theory is proposed as the theoretical foundation of information systems and has found rapidly growing applications in intelligent data analysis. An especially interesting problem is its relationship with other knowledge representation formalisms. The most well-known result is that it can provide a semantics for modal logics. Motivated by the strong analogy between quantiiers and modal...

متن کامل

Generalization of Rough Sets Using Relationships Between Attribute Values

The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The relation, not necessarily equivalence, between objects are defined in terms of relationships between attribute values. The adoption of other types of relations enables us to define various classes of rough set models. This study ...

متن کامل

Rough and Modal Algebras

We have used here a theorem prover DATAC (DDduction Automatique dans des Thhories Associatives et Commu-tatives) to discover, study and compare properties of rough and corresponding modal algebras. The preliminary results were reported in 19]. The prover was developed at CRIN & INRIA Lorraine, Nancy (France), by the rst author. The rough algebras were introduced by the second author in 17] as a...

متن کامل

A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning

This paper focuses on approximate reasoning based on the use of similarity spaces. Similarity spaces and the approximated relations induced by them are a generalization of the rough set-based approximations of Pawlak [17, 18]. Similarity spaces are used to define neighborhoods around individuals and these in turn are used to define approximate sets and relations. In any of the approaches, one w...

متن کامل

On a Well-behaved Relational Generalisation of Rough Set Approximations

We examine non-dual relational extensions of rough set approximations and find an extension which satisfies surprisingly many of the usual rough set properties. We then use this definition to give an explanation for an observation made by Samanta and Chakraborty in their recent paper [P. Samanta and M.K. Chakraborty. Interface of rough set systems and modal logics: A survey. Transactions on Rou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Intelligent Automation & Soft Computing

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1996